Evaluating Block-level Optimization Through the IO Path

نویسندگان

  • Alma Riska
  • James Larkby-Lahet
  • Erik Riedel
چکیده

This paper focuses on evaluation of the effectiveness of optimization at various layers of the IO path, such as the file system, the device driver scheduler, and the disk drive itself. IO performance is enhanced via effective block allocation at the file system, request merging and reordering at the device driver, and additional complex request reordering at the disk drive. Our measurements show that effective combination of these optimization forms yields superior performance under specific workloads. In particular, the impact on IO performance of technological advances in modern disk drives (i.e., reduction on head positioning times and deployment of complex request scheduling) is shown. For example, if the outstanding requests in the IO subsystem can all be accommodated by the disk queue buffer then disk level request scheduling is as effective as to close any gaps in the performance between IO request schedulers at the device driver level. Even more, for disk drives with write through caches, large queue depths improve overall IO throughput and when combined with the best performing disk scheduling algorithm at the device driver level, perform comparably with an IO subsystem where disks have write-back caches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Optimization of Input-Output Block using Graphene Nano-ribbon Transistors

In the electronics industry, scaling and optimization is final goal. But, according to ITRS predictions, silicon as basic material for semiconductors, is facing physical limitation and approaching the end of the path. Therefore, researchers are looking for the silicon replacement. Until now, carbon and its allotrope, graphene, look to be viable candidates. Among different circuits, IO block is ...

متن کامل

An Experimental Study on IO Optimization Techniques for Flash-based Transaction Processing Systems

Abstract Flash SSDs are being considered and partially starting to be utilized for enterprise storage. In order to maximize the performance benefit, different IO optimization techniques can be applied to the existing storage system. We examined the IO optimization techniques and the distinct features of the flash SSD. The IOs applied with optimization techniques are analyzed through the IO path...

متن کامل

OCR extensions - local identifiers, labeled GUIDs, file IO, and data block partitioning

We present several proposals for extending the Open Community Runtime (OCR) specification. The extension are identifiers with local validity, which use the concept of futures to provide OCR implementations more optimization opportunities, labeled GUIDs with creator functions, which are based on the local identifiers and allow the developer to create arrays of OCR objects that are safe from race...

متن کامل

Falcon: Scaling IO Performance in Multi-SSD Volumes

With the high throughput offered by solid-state drives (SSDs), multi-SSD volumes have become an attractive storage solution for big data applications. Unfortunately, the IO stack in current operating systems imposes a number of volume-level limitations, such as pervolume based IO processing in the block layer, single flush thread per volume for buffer cache management, locks for parallel IOs on...

متن کامل

Linear Approximations Representation of Moamagar Block Cipher

The security of block ciphers is assessed through their resistance to known attacks. One of the most important attacks is linear cryptanalysis. In this paper, we describe a model for presenting linear approximations for Moamagar block cipher. This graph shows the whole space of linear approximations for the block cipher algorithm is presented through its obtained multi-level weighted directed g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007